AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului. |
|||||||
STUDIA INFORMATICA - Ediţia nr.Sp.Issue 1 din 2009 | |||||||
Articol: |
DECOMPOSITION METHODS FOR LABEL PROPAGATION. Autori: LEHEL CSATÓ, ZALÁN BODÓ. |
||||||
Rezumat: In semi-supervised learning we exploit the "information" provided by an unlabelled data-set, in addition to the usually small training data-set. Acommonly used semi-supervised method is label propagation [9] where labels arepropagated from labelled to unlabelled data by employing similarity measures.The draw back of the algorithm is that its time requirement is prohibitive. This means that when a large amount of unlabelled data is used, a feasible algorithmis needed to compute the labels. In this paper we propose an approximation to label propagation. We divide the original problem into sub-problems that are computationally less prohibitive. A decomposition into K parallel sub-problems is considered where the sub-problems randomly and sparingly communicate with each other. Key words and phrases. semi-supervised learning, kernel methods, label propagation. |
|||||||